CLP(H):Constraint logic programming for hedges
نویسندگان
چکیده
منابع مشابه
CLP(H): Constraint logic programming for hedges
CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We study algebra...
متن کاملConstraint Logic Programming for Hedges: A Semantic Reconstruction
We describe the semantics of CLP(H): constraint logic programming over hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We give algebraic semantics of CLP(H) programs, defin...
متن کاملTruth-depressing hedges and BL-logic
We show a complete axiomatization of unary connectives interpreted by monotone and superdiagonal truth functions, so-called truth-depressing hedges. These connectives formalize linguistic hedges like “slightly true” and “more or less”. We follow ideas of [11] and show that BLvt-logic can be enriched by a unary connective for which we can establish strong completeness with respect to the desired...
متن کاملFuzzy Logic in Narrow Sense with Hedges
Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in the presence of vagueness, imprecision, and uncertainty, fuzzy logic should have the ability to deal with linguistic hedges, which play a very important rol...
متن کاملA Fuzzy Description Logic with Hedges as Concept Modifiers
In this paper we present a fuzzy description logic , where primitive concepts are modified by means of hedges. is strictly more expressive than Fuzzydefined in [8]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, we define a decision procedure for the unsatisfiability p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2015
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068415000071